Infinitary stability theory

نویسنده

  • Sebastien Vasey
چکیده

We introduce a new device in the study of abstract elementary classes (AECs): Galois Morleyization, which consists in expanding the models of the class with a relation for every Galois (orbital) type of length less than a fixed cardinal κ. We show: Theorem 0.1 (The semantic-syntactic correspondence). An AEC K is fully (< κ)-tame and type short if and only if Galois types are syntactic in the Galois Morleyization. This exhibits a correspondence between AECs and the syntactic framework of stability theory inside a model. We use the correspondence to make progress on the stability theory of tame and type short AECs. The main theorems are: Theorem 0.2. Let K be a LS(K)-tame AEC with amalgamation. The following are equivalent: (1) K is Galois stable in some λ ≥ LS(K). (2) K does not have the order property (defined in terms of Galois types). (3) There exist cardinals μ and λ0 with μ ≤ λ0 < i(2LS(K))+ such that K is Galois stable in any λ ≥ λ0 with λ = λ. Theorem 0.3. Let K be a fully (< κ)-tame and type short AEC with amalgamation, κ = iκ > LS(K). If K is Galois stable, then the class of κ-Galois saturated models of K admits an independence notion ((< κ)-coheir) which, except perhaps for extension, has the properties of forking in a first-order stable theory.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Games and Trees in Infinitary Logic: A Survey

We describe the work and underlying ideas of the Helsinki Logic Group in infinitary logic. The central idea is to use trees and Ehrenfeucht-Fräıssé games to measure differences between uncountable models. These differences can be expressed by sentences of so-called infinitely deep languages. This study has ramified to purely set-theoretical problems related to properties of trees, descriptive s...

متن کامل

On the Natural Order Relation in Peano Algebras with Finitary or Infinitary Operations

Most work on infinitary algebras in the literature makes ample use of the axiom of choice AC (see, e.g., [10],[12],[14]). While the theory of arbitrary infinitary algebras can hardly be developed in a satisfactory manner without AC, in the case of Peano algebras (= word algebras, absolutely free algebras) many or even most of the basic results can be proved in Zermelo-Fraenkel set theory ZF wit...

متن کامل

Infinitary Rewriting: Foundations Revisited

Infinitary Term Rewriting allows to express infinitary terms and infinitary reductions that converge to them. As their notion of transfinite reduction in general, and as binary relations in particular two concepts have been studied in the past: strongly and weakly convergent reductions, and in the last decade research has mostly focused around the former. Finitary rewriting has a strong connect...

متن کامل

Infinitary Proof Theory: the Multiplicative Additive Case

7 Infinitary and regular proofs are commonly used in fixed point logics. Being natural intermediate 8 devices between semantics and traditional finitary proof systems, they are commonly found in 9 completeness arguments, automated deduction, verification, etc. However, their proof theory 10 is surprisingly underdeveloped. In particular, very little is known about the computational 11 behavior o...

متن کامل

Unique Normal Forms in Infinitary Weakly Orthogonal Term Rewriting

We present some contributions to the theory of infinitary rewriting for weakly orthogonal term rewrite systems, in which critical pairs may occur provided they are trivial. We show that the infinitary unique normal form property (UN∞) fails by a simple example of a weakly orthogonal TRS with two collapsing rules. By translating this example, we show that UN∞ also fails for the infinitary λβη-ca...

متن کامل

On the infinitary proof theory of logics with fixed points. (Théorie de la démonstration infinitaire pour les logiques à points fixes)

The subject of this thesis is the proof theory of logics with fixed points, such as the μ-calculus, linear-logic with fixed points, etc. These logics are usually equipped with finitary deductive systems that rely on Park’s rules for induction. other proof systems for these logics exist, which rely on infinitary proofs, but they are much less developped. This thesis contributes to reduce this de...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Arch. Math. Log.

دوره 55  شماره 

صفحات  -

تاریخ انتشار 2016